A Modified Dragonfly Optimization Algorithm for Single- and Multiobjective Problems Using Brownian Motion
نویسندگان
چکیده
منابع مشابه
Solving Multiobjective Optimization Problems using Evolutionary Algorithm
Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملGases Brownian Motion Optimization: an Algorithm for Optimization (GBMO)
In recent years, different optimization methods have been developed for optimization problem. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new algorithm for optimization inspired by the gases brownian motion and turbulent rotational motion is introduced, which is called Gases Brownian Motion Optimization (GBMO). The proposed algorithm is created using the fe...
متن کاملA Modified Invasive Weed Optimization Algorithm for Multiobjective Flexible Job Shop Scheduling Problems
In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the criteria to minimize the maximum completion time (makespan), the total workload of machines and the workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour of weeds in colon...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2019
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2019/6871298